The cones of Hilbert functions of squarefree modules

In this paper, we study different generalizations of the notion of squarefreeness for ideals to the more general case of modules. We describe the cones of Hilbert functions for squarefree modules in general and those generated in degree zero. We give their extremal rays and defining inequalities. For squarefree modules generated in degree zero, we compare the defining inequalities of that cone with the classical Kruskal-Katona bound, also asymptotically.Comment: 17 pages, 2 figures. This paper was produced during Pragmatic 201

Pattern avoidance and the Bruhat order on involutions

We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin paths is demonstrated.Comment: 14 pages, 5 figure

Stanley's conjecture, cover depth and extremal simplicial complexes

A famous conjecture by R. Stanley relates the depth of a module, an algebraic invariant, with the so-called Stanley depth, a geometric one. We describe two related geometric notions, the cover depth and the greedy depth, and we study their relations with the Stanley depth for Stanley-Reisner rings of simplicial complexes. This leads to a quest for the existence of extremely non-partitionable simplicial complexes. We include several open problems and questions.This paper is a report about a research project suggested by J. Herzog at the summer school P.R.A.G.MAT.I.C. 2008 at the University of Catania. In particular, the paper describes a direction where we expect that possible counterexamples can be found at least for a weaker version of Stanley’s conjecture

Connectivity and embeddability of buildings and manifolds

The results presented in is thesis concern combinatorial and topological properties of objects closely related to geometry, but regarded in combinatorial terms. Papers A and C have in common that they are intended to study properties of buildings, whereas Papers A and B both are concerned with the connectivity of graphs of simplicial complexes. In Paper A it is shown that graphs of thick, locally finite and 2-spherical buildings have the highest possible connectivity given their regularity and maximal degree. Lower bounds on the connectivity are given also for graphs of order complexes of geometric lattices. In Paper B an interpolation between two classical results on the connectivity of graphs of combinatorial manifolds is developed. The classical results are by Barnette for general combinatorial manifolds and by Athanasiadis for flag combinatorial manifolds. An invariant b Δof a combinatorial manifold Δ is introduced and it is shown thatthe graph of is (2d − bΔ)-connected. The concept of banner triangulations of manifolds is defined. This is a generalization of flagtriangulations, preserving Athanasiadis’ connectivity bound. In Paper C we study non-embeddability for order complexes of thick geometric lattices and some classes of finite buildings, all of which are d-dimensional order complexes of certain posets. They are shown to be hard to embed, which means that they cannot be embedded in Eucledian space of lower dimension than 2d+1, which is sufficient for all d-dimensional simplicial complexes. The notion of weakly independent atom configurations in general posets is introduced. Using properties of the van Kampen obstruction, it is shown that the existence of such a configuration makes the order complex of a poset hard to embed

Connectivity and embeddability of buildings and manifolds

The results presented in is thesis concern combinatorial and topological properties of objects closely related to geometry, but regarded in combinatorial terms. Papers A and C have in common that they are intended to study properties of buildings, whereas Papers A and B both are concerned with the connectivity of graphs of simplicial complexes. In Paper A it is shown that graphs of thick, locally finite and 2-spherical buildings have the highest possible connectivity given their regularity and maximal degree. Lower bounds on the connectivity are given also for graphs of order complexes of geometric lattices. In Paper B an interpolation between two classical results on the connectivity of graphs of combinatorial manifolds is developed. The classical results are by Barnette for general combinatorial manifolds and by Athanasiadis for flag combinatorial manifolds. An invariant b Δof a combinatorial manifold Δ is introduced and it is shown thatthe graph of is (2d − bΔ)-connected. The concept of banner triangulations of manifolds is defined. This is a generalization of flagtriangulations, preserving Athanasiadis’ connectivity bound. In Paper C we study non-embeddability for order complexes of thick geometric lattices and some classes of finite buildings, all of which are d-dimensional order complexes of certain posets. They are shown to be hard to embed, which means that they cannot be embedded in Eucledian space of lower dimension than 2d+1, which is sufficient for all d-dimensional simplicial complexes. The notion of weakly independent atom configurations in general posets is introduced. Using properties of the van Kampen obstruction, it is shown that the existence of such a configuration makes the order complex of a poset hard to embed

CONNECTIVITY OF CHAMBER GRAPHS OF BUILDINGS AND RELATED COMPLEXES

Abstract. Let ∆ be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(∆), whose edges are the pairs of adjacent chambers in ∆, is known to be q-regular for a certain number q = q(∆). Our main result is that G(∆) is q-connected in the sense of graph theory. Similar results are proved for the chamber graphs of Coxeter complexes and for order complexes of geometric lattices. 1